TSTP Solution File: NUM796^1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM796^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.GFVgPhckfs true
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 12:44:15 EDT 2023
% Result : Theorem 1.09s 0.78s
% Output : Refutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 31 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 35 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 121 ( 15 ~; 9 |; 0 &; 92 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 0 ^; 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(rat_type,type,
rat: $tType ).
thf(u0_type,type,
u0: rat ).
thf(moreis_type,type,
moreis: rat > rat > $o ).
thf(more_type,type,
more: rat > rat > $o ).
thf(y0_type,type,
y0: rat ).
thf(lessis_type,type,
lessis: rat > rat > $o ).
thf(pl_type,type,
pl: rat > rat > rat ).
thf(less_type,type,
less: rat > rat > $o ).
thf(z0_type,type,
z0: rat ).
thf(x0_type,type,
x0: rat ).
thf(satz85,axiom,
! [Xx0: rat,Xy0: rat] :
( ( lessis @ Xx0 @ Xy0 )
=> ( moreis @ Xy0 @ Xx0 ) ) ).
thf(zip_derived_cl5,plain,
! [X0: rat,X1: rat] :
( ( moreis @ X0 @ X1 )
| ~ ( lessis @ X1 @ X0 ) ),
inference(cnf,[status(esa)],[satz85]) ).
thf(satz83,axiom,
! [Xx0: rat,Xy0: rat] :
( ( less @ Xx0 @ Xy0 )
=> ( more @ Xy0 @ Xx0 ) ) ).
thf(zip_derived_cl4,plain,
! [X0: rat,X1: rat] :
( ( more @ X0 @ X1 )
| ~ ( less @ X1 @ X0 ) ),
inference(cnf,[status(esa)],[satz83]) ).
thf(satz99b,axiom,
! [Xx0: rat,Xy0: rat,Xz0: rat,Xu0: rat] :
( ( more @ Xx0 @ Xy0 )
=> ( ( moreis @ Xz0 @ Xu0 )
=> ( more @ ( pl @ Xx0 @ Xz0 ) @ ( pl @ Xy0 @ Xu0 ) ) ) ) ).
thf(zip_derived_cl3,plain,
! [X0: rat,X1: rat,X2: rat,X3: rat] :
( ~ ( more @ X0 @ X1 )
| ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) )
| ~ ( moreis @ X2 @ X3 ) ),
inference(cnf,[status(esa)],[satz99b]) ).
thf(satz82,axiom,
! [Xx0: rat,Xy0: rat] :
( ( more @ Xx0 @ Xy0 )
=> ( less @ Xy0 @ Xx0 ) ) ).
thf(zip_derived_cl2,plain,
! [X0: rat,X1: rat] :
( ( less @ X0 @ X1 )
| ~ ( more @ X1 @ X0 ) ),
inference(cnf,[status(esa)],[satz82]) ).
thf(zip_derived_cl11,plain,
! [X0: rat,X1: rat,X2: rat,X3: rat] :
( ~ ( moreis @ X2 @ X0 )
| ~ ( more @ X3 @ X1 )
| ( less @ ( pl @ X1 @ X0 ) @ ( pl @ X3 @ X2 ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl3,zip_derived_cl2]) ).
thf(satz99d,conjecture,
less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ).
thf(zf_stmt_0,negated_conjecture,
~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ),
inference('cnf.neg',[status(esa)],[satz99d]) ).
thf(zip_derived_cl6,plain,
~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl15,plain,
( ~ ( more @ y0 @ x0 )
| ~ ( moreis @ u0 @ z0 ) ),
inference('sup-',[status(thm)],[zip_derived_cl11,zip_derived_cl6]) ).
thf(zip_derived_cl17,plain,
( ~ ( less @ x0 @ y0 )
| ~ ( moreis @ u0 @ z0 ) ),
inference('sup-',[status(thm)],[zip_derived_cl4,zip_derived_cl15]) ).
thf(l,axiom,
less @ x0 @ y0 ).
thf(zip_derived_cl0,plain,
less @ x0 @ y0,
inference(cnf,[status(esa)],[l]) ).
thf(zip_derived_cl19,plain,
~ ( moreis @ u0 @ z0 ),
inference(demod,[status(thm)],[zip_derived_cl17,zip_derived_cl0]) ).
thf(zip_derived_cl21,plain,
~ ( lessis @ z0 @ u0 ),
inference('sup-',[status(thm)],[zip_derived_cl5,zip_derived_cl19]) ).
thf(k,axiom,
lessis @ z0 @ u0 ).
thf(zip_derived_cl1,plain,
lessis @ z0 @ u0,
inference(cnf,[status(esa)],[k]) ).
thf(zip_derived_cl23,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl21,zip_derived_cl1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM796^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.GFVgPhckfs true
% 0.13/0.36 % Computer : n012.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Fri Aug 25 11:28:11 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.13/0.36 % Running portfolio for 300 s
% 0.13/0.36 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.36 % Number of cores: 8
% 0.13/0.36 % Python version: Python 3.6.8
% 0.13/0.36 % Running in HO mode
% 0.21/0.70 % Total configuration time : 828
% 0.21/0.70 % Estimated wc time : 1656
% 0.21/0.70 % Estimated cpu time (8 cpus) : 207.0
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.21/0.76 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 1.09/0.77 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 1.09/0.77 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 1.09/0.77 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 1.09/0.78 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 1.09/0.78 % Solved by lams/40_c.s.sh.
% 1.09/0.78 % done 9 iterations in 0.011s
% 1.09/0.78 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.09/0.78 % SZS output start Refutation
% See solution above
% 1.09/0.78
% 1.09/0.78
% 1.09/0.78 % Terminating...
% 1.58/0.88 % Runner terminated.
% 1.58/0.89 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------